全文获取类型
收费全文 | 359篇 |
免费 | 93篇 |
国内免费 | 25篇 |
出版年
2024年 | 1篇 |
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 4篇 |
2020年 | 8篇 |
2019年 | 9篇 |
2018年 | 6篇 |
2017年 | 15篇 |
2016年 | 19篇 |
2015年 | 15篇 |
2014年 | 19篇 |
2013年 | 25篇 |
2012年 | 30篇 |
2011年 | 36篇 |
2010年 | 21篇 |
2009年 | 36篇 |
2008年 | 30篇 |
2007年 | 25篇 |
2006年 | 24篇 |
2005年 | 16篇 |
2004年 | 24篇 |
2003年 | 19篇 |
2002年 | 20篇 |
2001年 | 10篇 |
2000年 | 8篇 |
1999年 | 11篇 |
1998年 | 3篇 |
1997年 | 6篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 1篇 |
排序方式: 共有477条查询结果,搜索用时 15 毫秒
81.
高速核入射到高温热平衡等离子体背景中,由于入射核动能远大于背景等离体中带电粒子之平均动能,入射核在与背景等离子体达到热平衡之前,会存在一段逐渐损失能量的非平衡弛豫过程。本文以高速氘核入射到高温氘化锂等离子体为例,在计及氘核的这种非平衡弛豫过程时,给出了一种计算热核反应D(t,n)~4He之反应率参数的方法。氘核在弛豫过程中的能量损失考虑了氘核与各种带电粒子的库仑散射过程,其能量损失率采用快速带电粒子的慢化理论来计算;氘与背景等离子体中的原子核发生的核反应过程,考虑了非平衡状态下束靶机制的D(t,n)~4He反应和热平衡状态下的D(t.n)~4He反应。在暂未考虑核散射的情况下,计算结果表明,当等离子体温度在7.5KeV~20KeV范围内变化时,氘核的非平衡弛豫过程对热平衡状态下D(t,n)~4He反应率参数的修正因子大致在1.0062~1.0943范围内变动,且温度越高,修正因子越小。计算还表明,当温度一定时,修正因子随等离子体中粒子的数密度变化不明显。 相似文献
82.
吴颖瑜 《国防科技大学学报》1990,12(3):102-105
本文把马尔可夫过程和目标规划结合起来,提出人才结构系统分析的单项控制和多项控制,并在单项控制模型的基础上发展成了多项控制模型,加强了模型的可信度和通用性。 相似文献
83.
金治明 《国防科技大学学报》1990,12(3):58-62
设(X_n,F_n)_1~∞是适应的报酬序列,(γ_n)是相应的snell 包,(A_n)是(γ_n)的Doob-Meyer 分解中零初值的可料增过程。本文继J.Klass 的研究证明了σ_1=inf{K≥1:X_k≥γ_k}是最小半最优的且是最大严格正则的广义规则,而K_0=sup{n≥0:A_n=0}<∞是最大正则的广义规则,从而得出了广义最优规则唯一性的另一表述。 相似文献
84.
An R out of N repairable system consisting of N components and operates if at least R components are functioning. Repairable means that failed components are repaired, and upon repair completion they are as good as new. We derive formulas for the expected up‐time, expected down‐time, and the availability of the system, using Markov renewal processes. We assume that either the repair times of the components are generally distributed and the components' lifetimes are exponential or vice versa. The analysis is done for systems with either cold or warm stand‐by. Numerical examples are given for several life time and repair time distributions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 483–498, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10025 相似文献
85.
王秋彧 《中国人民武装警察部队学院学报》2009,25(10):16-19
简述了煤制油的发展历程,分析了煤制油工业的火灾危险性和火灾特点,初步总结和探讨了煤制油工业火灾的扑救方法,对引发的相关问题作了一些思考。 相似文献
86.
从深刻理解数学概念内涵、熟悉数学公式及变式和注重解题过程分析三个方面谈如何有效培养学生的解题能力 ,进而促进学生数学能力的发展 相似文献
87.
Steady‐state diffusion approximations for discrete‐time queue in hospital inpatient flow management 下载免费PDF全文
In this article, we analyze a discrete‐time queue that is motivated from studying hospital inpatient flow management, where the customer count process captures the midnight inpatient census. The stationary distribution of the customer count has no explicit form and is difficult to compute in certain parameter regimes. Using the Stein's method framework, we identify a continuous random variable to approximate the steady‐state customer count. The continuous random variable corresponds to the stationary distribution of a diffusion process with state‐dependent diffusion coefficients. We characterize the error bounds of this approximation under a variety of system load conditions—from lightly loaded to heavily loaded. We also identify the critical role that the service rate plays in the convergence rate of the error bounds. We perform extensive numerical experiments to support the theoretical findings and to demonstrate the approximation quality. In particular, we show that our approximation performs better than those based on constant diffusion coefficients when the number of servers is small, which is relevant to decision making in a single hospital ward. 相似文献
88.
We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound. 相似文献
89.
This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011 相似文献
90.